New FFT structures based on the Bruun algorithm
نویسندگان
چکیده
منابع مشابه
New FFT structures based on the Bruun algorithm
In some signal processing applications, the input data are real. In this case, the Bruun algorithm for computation of the Discrete Fourier Transform (DFT) is attractive. This correspondence offers a pipeline and a recirculated shuffle network implementation of the Bruun algorithm. The parallel pipeline and recirculated FFT structures are implemented based on the modified perfect shuffle network.
متن کاملthe role of task-based techniques on the acquisition of english language structures by the intermediate efl students
this study examines the effetivenss of task-based activities in helping students learn english language structures for a better communication. initially, a michigan test was administered to the two groups of 52 students majoring in english at the allameh ghotb -e- ravandi university to ensure their homogeneity. the students scores on the grammar part of this test were also regarded as their pre...
15 صفحه اولImage Compression Based on Improved FFT Algorithm
Image compression is a crucial step in image processing area. Image Fourier transforms is the classical algorithm which can convert image from spatial domain to frequency domain. Because of its good concentrative property with transform energy, Fourier transform has been widely applied in image coding, image segmentation, image reconstruction. This paper adopts Radix-4 Fast Fourier transform (R...
متن کاملA New Radix - 4 Fft Algorithm
The Radix-4 Fast Fourier Transform (FFT) is widely accepted for signal processing applications in wireless communication system. Here, we present a new Radix-4 FFT which reduces the operational count by 6% lesser than standard Radix-4 FFT without losing any arithmetic accuracy. Simulation results are also given for the verification of the algorithm.
متن کاملAlgorithm-Based Fault Tolerance for FFT Networks
Call packing has been recognized as a routing scheme thatsignificantly reduces the blocking probability of connection requests ina circuit-switched Clos multistage interconnection network. In this briefcontribution, for the first time, we develop general analytical models forthe point-to-point blocking probability of the call-packing scheme appliedto Clos networks. By introd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Acoustics, Speech, and Signal Processing
سال: 1990
ISSN: 0096-3518
DOI: 10.1109/29.45572